Stabbing Oriented Convex Polygons in Randomized O(n) Time
نویسندگان
چکیده
We present a randomized algorithm that determines, in expectedO(n2) time, whether a line exists that stabs each of a set of oriented convex polygons in R3 with a total of n edges. If a stabbing line exists, the algorithm computes at least one such line. We show that the computation amounts to constructing a convex polytope in R5 and inspecting its edges for intersections with a four-dimensional surface, the Pl ucker quadric.
منابع مشابه
Optimal Nearly-Similar Polygon Stabbers of Convex Polygons
A convex polygon that is nearly-similar to a model polygon P has sides parallel and in the same order to the corresponding sides of P. The lengths of the sides are unrestricted and may be zero. Given a set of target convex polygons in the plane with a total of n vertices, and a xed model convex stabbing polygon P, the minimum-perimeter polygon nearly-similar to P that stabs the targets can be f...
متن کاملStabbing Convex Polygons with a Segment or a Polygon
Let O = {O1, . . . , Om} be a set of m convex polygons in R 2 with a total of n vertices, and let B be another convex k-gon. A placement of B, any congruent copy of B (without reflection), is called free if B does not intersect the interior of any polygon in O at this placement. A placement z of B is called critical if B forms three “distinct” contacts with O at z. Let φ(B,O) be the number of f...
متن کاملConstant-Time Convexity Problems on Reconfigurable Meshes
The purpose of this paper is to demonstrate that the versatility of the reconngurable mesh can be exploited to devise constant-time algorithms for a number of important computational tasks relevant to robotics, computer graphics, image processing, and computer vision. In all our algorithms, we assume that one or two n-vertex (convex) polygons are pretiled, one vertex per processor, onto a recon...
متن کاملOptimal Algorithms for Stabbing Polygons by Monotone Chains
In this paper we present optimal algorithms to compute monotone stabbers for convex polygons. More precisely, given a set of m convex polygons with n vertices in total we want to stab the polygons with an x-monotone polygonal chain such that each polygon is entered at its leftmost point and departed at its rightmost point. Since such a stabber does not exist in general, we study two related pro...
متن کاملApproximating Polygons and Subdivisions with Minimum Link Paths
A linear time algorithm for minimum link paths inside a simple polygon. Algorithms for the reduction of the number of points required to represent a line or its caricature. Computing the visibility polygon from a convex set and related problems. implementation of the Douglas-Peucker line simpli-cation algorithm using at most cn log n operations. In preparation, 1991. 16] H. Imai and M. Iri. Com...
متن کامل